// 斐波那契数列非递归解法
#include <bits/stdc++.h>
using namespace std;
int ans1 = 0;
int ans2 = 1;
int main()
{
    int input;
    cin >> input;
    int a[10] = {0};
    for(int i=0;i<input;i++)
    {
        a[i] = ans1 + ans2;
        ans1 = ans2;
        ans2 = a[i];
    }
    for(int i=0;i<input;i++)
    {
        cout << a[i] << " ";
    }
    return 0;
}